TSTP Solution File: NUM668^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM668^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:56:08 EDT 2024
% Result : Theorem 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 9 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 5 ( 4 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 23 ( 7 ~; 0 |; 0 &; 16 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 4 ( 0 ^ 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_22,type,
x: nat ).
thf(decl_23,type,
y: nat ).
thf(decl_24,type,
pl: nat > nat > nat ).
thf(satz18,conjecture,
~ ! [X1: nat] :
( ( pl @ x @ y )
!= ( pl @ x @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.q0aQolILXR/E---3.1_17000.p',satz18) ).
thf(c_0_1,negated_conjecture,
~ ~ ! [X1: nat] :
( ( pl @ x @ y )
!= ( pl @ x @ X1 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz18])]) ).
thf(c_0_2,negated_conjecture,
! [X3: nat] :
( ( pl @ x @ y )
!= ( pl @ x @ X3 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: nat] :
( ( pl @ x @ y )
!= ( pl @ x @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM668^1 : TPTP v8.1.2. Released v3.7.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 09:14:50 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running higher-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.q0aQolILXR/E---3.1_17000.p
% 0.22/0.50 # Version: 3.1.0-ho
% 0.22/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.50 # Starting sh4l with 300s (1) cores
% 0.22/0.50 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.22/0.50 # new_ho_10 with pid 17101 completed with status 0
% 0.22/0.50 # Result found by new_ho_10
% 0.22/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.50 # No SInE strategy applied
% 0.22/0.50 # Search class: HUUPF-FFSF22-SFFFFFNN
% 0.22/0.50 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.50 # Starting new_ho_10 with 901s (1) cores
% 0.22/0.50 # Starting sh5l with 151s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 151s (1) cores
% 0.22/0.50 # Starting new_bool_2 with 151s (1) cores
% 0.22/0.50 # Starting new_bool_9 with 146s (1) cores
% 0.22/0.50 # new_bool_9 with pid 17110 completed with status 0
% 0.22/0.50 # Result found by new_bool_9
% 0.22/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.50 # No SInE strategy applied
% 0.22/0.50 # Search class: HUUPF-FFSF22-SFFFFFNN
% 0.22/0.50 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.50 # Starting new_ho_10 with 901s (1) cores
% 0.22/0.50 # Starting sh5l with 151s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 151s (1) cores
% 0.22/0.50 # Starting new_bool_2 with 151s (1) cores
% 0.22/0.50 # Starting new_bool_9 with 146s (1) cores
% 0.22/0.50 # Preprocessing time : 0.001 s
% 0.22/0.50 # Presaturation interreduction done
% 0.22/0.50
% 0.22/0.50 # Proof found!
% 0.22/0.50 # SZS status Theorem
% 0.22/0.50 # SZS output start CNFRefutation
% See solution above
% 0.22/0.50 # Parsed axioms : 5
% 0.22/0.50 # Removed by relevancy pruning/SinE : 0
% 0.22/0.50 # Initial clauses : 5
% 0.22/0.50 # Removed in clause preprocessing : 4
% 0.22/0.50 # Initial clauses in saturation : 1
% 0.22/0.50 # Processed clauses : 2
% 0.22/0.50 # ...of these trivial : 0
% 0.22/0.50 # ...subsumed : 0
% 0.22/0.50 # ...remaining for further processing : 2
% 0.22/0.50 # Other redundant clauses eliminated : 0
% 0.22/0.50 # Clauses deleted for lack of memory : 0
% 0.22/0.50 # Backward-subsumed : 0
% 0.22/0.50 # Backward-rewritten : 0
% 0.22/0.50 # Generated clauses : 1
% 0.22/0.50 # ...of the previous two non-redundant : 0
% 0.22/0.50 # ...aggressively subsumed : 0
% 0.22/0.50 # Contextual simplify-reflections : 0
% 0.22/0.50 # Paramodulations : 0
% 0.22/0.50 # Factorizations : 0
% 0.22/0.50 # NegExts : 0
% 0.22/0.50 # Equation resolutions : 1
% 0.22/0.50 # Disequality decompositions : 0
% 0.22/0.50 # Total rewrite steps : 0
% 0.22/0.50 # ...of those cached : 0
% 0.22/0.50 # Propositional unsat checks : 0
% 0.22/0.50 # Propositional check models : 0
% 0.22/0.50 # Propositional check unsatisfiable : 0
% 0.22/0.50 # Propositional clauses : 0
% 0.22/0.50 # Propositional clauses after purity: 0
% 0.22/0.50 # Propositional unsat core size : 0
% 0.22/0.50 # Propositional preprocessing time : 0.000
% 0.22/0.50 # Propositional encoding time : 0.000
% 0.22/0.50 # Propositional solver time : 0.000
% 0.22/0.50 # Success case prop preproc time : 0.000
% 0.22/0.50 # Success case prop encoding time : 0.000
% 0.22/0.50 # Success case prop solver time : 0.000
% 0.22/0.50 # Current number of processed clauses : 1
% 0.22/0.50 # Positive orientable unit clauses : 0
% 0.22/0.50 # Positive unorientable unit clauses: 0
% 0.22/0.50 # Negative unit clauses : 1
% 0.22/0.50 # Non-unit-clauses : 0
% 0.22/0.50 # Current number of unprocessed clauses: 0
% 0.22/0.50 # ...number of literals in the above : 0
% 0.22/0.50 # Current number of archived formulas : 0
% 0.22/0.50 # Current number of archived clauses : 1
% 0.22/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.50 # Non-unit clause-clause subsumptions : 0
% 0.22/0.50 # Unit Clause-clause subsumption calls : 0
% 0.22/0.50 # Rewrite failures with RHS unbound : 0
% 0.22/0.50 # BW rewrite match attempts : 0
% 0.22/0.50 # BW rewrite match successes : 0
% 0.22/0.50 # Condensation attempts : 0
% 0.22/0.50 # Condensation successes : 0
% 0.22/0.50 # Termbank termtop insertions : 124
% 0.22/0.50 # Search garbage collected termcells : 14
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.003 s
% 0.22/0.50 # System time : 0.001 s
% 0.22/0.50 # Total time : 0.004 s
% 0.22/0.50 # Maximum resident set size: 1688 pages
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.007 s
% 0.22/0.50 # System time : 0.006 s
% 0.22/0.50 # Total time : 0.013 s
% 0.22/0.50 # Maximum resident set size: 1704 pages
% 0.22/0.50 % E---3.1 exiting
% 0.22/0.50 % E exiting
%------------------------------------------------------------------------------